Languages whose n-element subsets are codes
نویسندگان
چکیده
منابع مشابه
Spaces Whose Pseudocompact Subspaces Are Closed Subsets
Every first countable pseudocompact Tychonoff space X has the property that every pseudocompact subspace of X is a closed subset of X (denoted herein by “FCC”). We study the property FCC and several closely related ones, and focus on the behavior of extension and other spaces which have one or more of these properties. Characterization, embedding and product theorems are obtained, and some exam...
متن کاملModules whose direct summands are FI-extending
A module $M$ is called FI-extending if every fully invariant submodule of $M$ is essential in a direct summand of $M$. It is not known whether a direct summand of an FI-extending module is also FI-extending. In this study, it is given some answers to the question that under what conditions a direct summand of an FI-extending module is an FI-extending module?
متن کاملSome Perturbed Inequalities of Ostrowski Type for Functions whose n-th Derivatives Are Bounded
We firstly establish an identity for $n$ time differentiable mappings Then, a new inequality for $n$ times differentiable functions is deduced. Finally, some perturbed Ostrowski type inequalities for functions whose $n$th derivatives are of bounded variation are obtained.
متن کاملBit-optimal Decoding of Codes Whose Tanner Graphs Are Trees
We introduce a group algebra formulation for bit optimal decoding of binary block codes. We use this new framework to give a simple algebraic proof that Pearl’s and Gallager’s belief propagation decoding algorithms are bit-optimal when the Tanner graph of the code is a tree. We believe that these derivations of known results give new insights into the issues of decoding on graphs from the algeb...
متن کاملSome Families of Graphs whose Domination Polynomials are Unimodal
Let $G$ be a simple graph of order $n$. The domination polynomial of $G$ is the polynomial $D(G, x)=sum_{i=gamma(G)}^{n} d(G,i) x^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$ and $gamma(G)$ is the domination number of $G$. In this paper we present some families of graphs whose domination polynomials are unimodal.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1992
ISSN: 0304-3975
DOI: 10.1016/0304-3975(92)90341-c